Uniform constant-depth threshold circuits for division and iterated multiplication
نویسندگان
چکیده
منابع مشابه
Uniform constant-depth threshold circuits for division and iterated multiplication
It has been known since the mid-1980's [15, 46, 47] that integer division can be performed by poly-time uniform constant-depth circuits of Majority gates; equivalently, the division problem lies in P-uniform TC 0. Recently this was improved to L-uniform TC 0 [19], but it remained unknown whether division can be performed by DLOGTIME-uniform TC 0 circuits. The DLOGTIME uniformity condition is re...
متن کاملDepth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation
The multiplication operation and the computation of symmetric functions are fundamental problems in arithmetic and algebraic computation. We describe unit-weight threshold circuits to perform the multiplication of two n-bit integers, which have fan-in k, edge complexity O(n 2+1=d), and depth O(log d + log n= log k), for any xed integer d > 0. For a given fan-in, our constructions have considera...
متن کاملA Bounded Arithmetic Theory for Constant Depth Threshold Circuits
We deene an extension R 0 2 of the bounded arithmetic theory R 0 2 and show that the class of functions b 1-deenable in R 0 2 coincides with the computational complexity class TC 0 of functions computable by polynomial size, constant depth threshold circuits.
متن کاملUniform Circuits for Division: Consequences and Problems
Integer division has been known to lie in P-uniform TC since the mid1980’s, and recently this was improved to L-uniform TC. At the time that the results in this paper were proved and submitted for conference presentation, it was unknown whether division lay in DLOGTIME-uniform TC (also known as FOM). We obtain tight bounds on the uniformity required for division, by showing that division is com...
متن کاملA Depth-Five Lower Bound for Iterated Matrix Multiplication
We prove that certain instances of the iterated matrix multiplication (IMM) family of polynomials with N variables and degree n require NΩ( √ n) gates when expressed as a homogeneous depth-five ΣΠΣΠΣ arithmetic circuit with the bottom fan-in bounded by N1/2−ε. By a depth-reduction result of Tavenas, this size lower bound is optimal and can be achieved by the weaker class of homogeneous depth-fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2002
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(02)00025-9